An Efficient Multicast Distribution Scheme Combining Erasure Codes and Direct Requests

نویسندگان

  • Jun Takahashi
  • Hideki Tode
  • Koso Murakami
چکیده

For the efficient multicast distribution services on the Internet, suppressing the influence of packet loss is important issues. As a solution of this problem, Forward Error Correction (FEC) based on ReedSolomon codes is usually used. However, in the case of content delivery services for a large amount of data, this approach is not suitable. In this paper, we focus on the erasure codes which are new approach of FEC and propose the efficient multicast video distribution method which combines the multicast distribution using erasure codes and direct request to the server. We implement proposal method and confirm its efficiency from the viewpoints of redundancy and processing time. key words: IP multicast, reliable multicast, forward error correction, erasure codes

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computationally effecient group re-keying for time sensitive applications

Key distribution is an important problem for secure group communications. Multicast is an efficient means of distributing data in terms of resources usage. All the designated receivers or members in a multicast group share a session key. Session keys shall change dynamically to ensure both forward secrecy and backward secrecy of multicast sessions. The communication and storage complexity of mu...

متن کامل

A Novel Approach for Secured Symmetric Key Distribution in Dynamic Multicast Networks

–Multicasting is an efficient means of distributing data in terms of resources usage. All the designated receivers or members in a multicast group share a session key. Session keys shall change dynamically to ensure both forward secrecy and backward secrecy of multicast sessions. The communication and storage complexity of multicast key distribution problem has been studied extensively. We impl...

متن کامل

A Non-MDS Erasure Code Scheme for Storage Applications

This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...

متن کامل

An Efficient Rekeying Function Protocol with Multicast Key Distribution for Group Key Management in MANETs

Key management in the ad hoc network is a challenging issue concerning the security of the group communication. Group key management protocols can be approximately categorized into three: centralized, decentralized, and distributed. The much apt solution to provide the services like authentication, data integrity and data confidentiality is the establishment of a key management protocol. This p...

متن کامل

Memory - efficient segment - based packet - combining schemes in face of deadlines ( Extended version )

In this paper we consider segment-based hard-decision packet-combining schemes. The schemes presented here are memory-efficient and easy to implement, and some of them appproach the performance of majority-voting schemes without having the same memory requirements. One particularly interesting scheme combines segment-based transmission with Luby-type erasure codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 88-B  شماره 

صفحات  -

تاریخ انتشار 2005